Extending a Jordan ring homomorphism

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Characterization of Pseudo n-Jordan homomorphism Between unital algebras

Let A and B be Banach algebras and B be a right A-module. In this paper, under special hypotheses we prove that every pseudo (n+1)-Jordan homomorphism f:A----> B is a pseudo n-Jordan homomorphism and every pseudo n-Jordan homomorphism is an n-Jordan homomorphism

متن کامل

The Center of a Jordan Ring

and call the former the Jordan product and the latter the commutator or Lie product of a and b. If we use {ab} as product in place of the originally defined ab we obtain the Jordan ring 21/ determined by 21. Similarly the Lie ring 2tj is obtained by using [ab] in place of ab. Naturally if 21 has characteristic 2 then 21/=21*. I t is customary to exclude this case from consideration but in most ...

متن کامل

A Structured Multisignature based on a Non-Commutative Ring Homomorphism

Users’ signing order is an important factor in multisignature schemes. In fact the signing order often reflects signer’s rank in a signing group. So far, many multisignature schemes, called structured schemes, have been proposed that provide verifiability of the signing order associated with the structure of a group of signers. However, there are not many structured multisignature schemes utili...

متن کامل

Homomorphism IN (Q, L) -Fuzzy Normal Ideals of a Ring

In this paper, we study some of the properties of (Q, L) -fuzzy normal ideal of a ring and prove some results on these. 2000 AMS SUBJECT CLASSIFICATION: 03F55, 08A72, 20N25.

متن کامل

Extending graph homomorphism and simulation for real life graph matching

Among the vital problems in a variety of emerging applications is the graph matching problem, which is to determine whether two graphs are similar, and if so, find all the valid matches in one graph for the other, based on specified metrics. Traditional graph matching approaches are mostly based on graph homomorphism and isomorphism, falling short of capturing both structural and semantic simil...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1973

ISSN: 0002-9939

DOI: 10.1090/s0002-9939-1973-0321984-x